Transmittance matrices and flowgraph reduction

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

E-Clean Matrices and Unit-Regular Matrices

Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.

متن کامل

Minkowski Reduction of Integral Matrices

In 1905 Hermann Minkowski introduced his theory of reduction of positive definite quadratic forms. Recently, Hans J. Zassenhaus has suggested that this theory can be applied to the problem of row reduction of matrices of integers. Computational investigations have shown that for matrices with more columns than rows, the number of steps required for reduction decreases drastically. In this paper...

متن کامل

Factorial Rings and Diagonal Reduction of Matrices

The class of Bézout factorial rings is introduced and characterized. Using the factorial properties of such a ring R, and given a n×m matrix A over R, we find P ∈ GL(n, R) and Q ∈ GL(m, R) such that PAQ is diagonal with every element in the diagonal dividing the following one. Key-words: Ring, Bézout, principal, factorization, reduction of matrices.

متن کامل

Dimensionality Reduction for Sparse and Structured Matrices

Dimensionality reduction has become a critical tool for quickly solving massive matrix problems. Especially in modern data analysis and machine learning applications, an overabundance of data features or examples can make it impossible to apply standard algorithms efficiently. To address this issue, it is often possible to distill data to a much smaller set of informative features or examples, ...

متن کامل

Flowgraph Analysis of Large Electronic Networks

The paper presents a new method for signal flowgraph analysis of large electronic networks. A hierarchical decomposition approach is realized using the so-called upward analysis of the decomposed network. This approach allows fully symbolic network formulas to be obtained in time linearly proportional to the size of the network. A multiconnection characterization, suitable for upward analysis, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Modelling

سال: 1985

ISSN: 0270-0255

DOI: 10.1016/0270-0255(85)90060-0